Some insights on restarting symmetric eigenvalue methods with Ritz and harmonic Ritz vectors
نویسندگان
چکیده
Eigenvalue iterative methods, such as Arnoldi and Jacobi-Davidson, are typically used with restarting. This has signiicant performance shortcomings, since important components of the invariant subspace may be discarded. One way of saving more information at restart is the idea of \thick" restarting which keeps more Ritz vectors than needed. Our previously proposed dynamic thick restarting chooses these vectors in a way that has proved eecient on a wide variety of matrices. It is also possible to keep this information more compactly by combining thick restarting with a technique based on a three term recurrence. In this paper, we give strong experimental evidence that saving more information with thick restarting is not necessarily beneecial, and provide an explanation to the eeciency of the dynamic scheme. In addition, we show through a variety of experiments that restarting with harmonic Ritz instead of Ritz vectors does not improve the convergence of symmetric eigenvalue methods when an extreme part of the spectrum or some eigenpair within this part is needed. However, for computing highly interior eigenpairs, harmonic Ritz vectors may be the only viable alternative.
منابع مشابه
Restarting Techniques for the (jacobi-)davidson Symmetric Eigenvalue Methods
The (Jacobi-)Davidson method, which is a popular preconditioned extension to the Arnoldi method for solving large eigenvalue problems, is often used with restarting. This has significant performance shortcomings, since important components of the invariant subspace may be discarded. One way of saving more information at restart is through “thick” restarting, a technique that involves keeping mo...
متن کاملVariations of Ritz and Lehmann Bounds
Eigenvalue estimates that are optimal in some sense have selfevident appeal and leave estimators with a sense of virtue and economy. So, it is natural that ongoing searches for effective strategies for difficult tasks such as estimating matrix eigenvalues that are situated well into the interior of the spectrum revisit from time to time methods that are known to yield optimal bounds. This artic...
متن کاملImplicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
The generalized minimum residual method (GMRES) is well known for solving large nonsymmetric systems of linear equations. It generally uses restarting, which slows the convergence. However, some information can be retained at the time of the restart and used in the next cycle. We present algorithms that use implicit restarting in order to retain this information. Approximate eigenvectors determ...
متن کاملAugmented Implicitly Restarted Lanczos Bidiagonalization Methods
New restarted Lanczos bidiagonalization methods for the computation of a few of the largest or smallest singular values of a large matrix are presented. Restarting is carried out by augmentation of Krylov subspaces that arise naturally in the standard Lanczos bidiagonalization method. The augmenting vectors are associated with certain Ritz or harmonic Ritz vectors. Computed examples show the ne...
متن کاملOn the construction of symmetric nonnegative matrix with prescribed Ritz values
In this paper for a given prescribed Ritz values that satisfy in the some special conditions, we find a symmetric nonnegative matrix, such that the given set be its Ritz values.
متن کامل